package leetCode;

class Solution1 {
    public int[] searchRange(int[] nums, int target) {
        int[] ret = new int[2];
        ret[0] = ret[1] = -1;
        if(nums.length == 0) return ret;
        //处理边界左端点
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }
        //right和left相遇，等于target就在nums里面，反则没有
        if(nums[left] != target) return ret;
        else ret[0] = right;
        //处理右边界
        left = 0;
        right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left + 1) / 2;
            if(nums[mid] > target) right = mid - 1;
            else left = mid;
        }
        //left == right
        ret[1] = left;
        return ret;
    }
}